A Hybrid Improvement Heuristic for the Bin Packing Problem
نویسنده
چکیده
Given a set of n items with weights wi, i = 1, . . . , n, the bin packing (BP) problem consists of finding the minimum number of bins of capacity C necessary to pack the items, without violating the capacity constraint. This formulation also entails another problem (DBP), in which we seek to minimize the capacity of a fixed number m of identical bins, so that all items fit in the m bins without violating the capacity constraints. The bin packing problem is NP-hard, see [5].
منابع مشابه
A hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem
This work presents a hybrid improvement procedure for the bin packing problem and its application to the multiprocessor scheduling problem. This heuristic has several features: a new lower bound; reductions; initial solutions by reference to the dual problem; heuristics for load redistribution, and an improvement process utilizing tabu search. It improved the best known solutions for many of th...
متن کاملA Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem
Bin packing is a well-known NP-Hard optimization problem which has several real applications. Classical bin packing (BPP) is a simple model where all bins are identical. However, the variable sized bin packing problem (VSBPP) is a generalization of the bin packing problem where bins of different capacities are available for packing a set of items having different weights. The objective is to pa...
متن کاملA hybrid heuristic algorithm for the 2D variable-sized bin packing problem
In this paper, we consider the two-dimensional variable-sized bin packing problem (2DVSBPP) with guillotine constraint. 2DVSBPP is a well-known NP-hard optimization problem which has several real applications. A mixed bin packing algorithm (MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single bin problem, and then a backtracking al...
متن کامل